The Laplacian Energy of Hesitancy Fuzzy Graphs in Decision-Making Problems
نویسندگان
چکیده
Decision-making (DM) is a process in which several persons concurrently engage, examine the problems, evaluate potential alternatives, and select an appropriate option to problem. Technique for determining order preference by similarity ideal solution (TOPSIS) established DM process. The objective of this report happens broaden approach TOPSIS solve issues designed with Hesitancy fuzzy data, evaluation evidence given experts on possible solutions presents as decision matrices, each defined numbers. Findings: we represent analytical results, such designing satellite communication network assessing reservoir operation methods, demonstrate that our suggested thoughts may be used DM. Aim: We studied new testing method artificial system give proof future construction earth stations. aim identify best one from different places. are also finding schemes reservoir. In article, present concepts Laplacian energy (LE) graphs (HFGs), weight function LE HFGs, technique produce hesitancy weighted-average (HFWA). Also, consider practical examples illustrate applicability finest design systems schemes.
منابع مشابه
Seidel Signless Laplacian Energy of Graphs
Let $S(G)$ be the Seidel matrix of a graph $G$ of order $n$ and let $D_S(G)=diag(n-1-2d_1, n-1-2d_2,ldots, n-1-2d_n)$ be the diagonal matrix with $d_i$ denoting the degree of a vertex $v_i$ in $G$. The Seidel Laplacian matrix of $G$ is defined as $SL(G)=D_S(G)-S(G)$ and the Seidel signless Laplacian matrix as $SL^+(G)=D_S(G)+S(G)$. The Seidel signless Laplacian energy $E_{SL^+...
متن کاملOn net-Laplacian Energy of Signed Graphs
A signed graph is a graph where the edges are assigned either positive ornegative signs. Net degree of a signed graph is the dierence between the number ofpositive and negative edges incident with a vertex. It is said to be net-regular if all itsvertices have the same net-degree. Laplacian energy of a signed graph is defined asε(L(Σ)) =|γ_1-(2m)/n|+...+|γ_n-(2m)/n| where γ_1,...,γ_n are the ei...
متن کاملOn Laplacian energy of non-commuting graphs of finite groups
Let $G$ be a finite non-abelian group with center $Z(G)$. The non-commuting graph of $G$ is a simple undirected graph whose vertex set is $Gsetminus Z(G)$ and two vertices $x$ and $y$ are adjacent if and only if $xy ne yx$. In this paper, we compute Laplacian energy of the non-commuting graphs of some classes of finite non-abelian groups..
متن کاملDesigning a model of intuitionistic fuzzy VIKOR in multi-attribute group decision-making problems
Multiple attributes group decision making (MAGDM) is regarded as the process of determining the best feasible solution by a group of experts or decision makers according to the attributes that represent different effects. In assessing the performance of each alternative with respect to each attribute and the relative importance of the selected attributes, quantitative/qualitative evaluations ar...
متن کاملLaplacian Energy of a Fuzzy Graph
A concept related to the spectrum of a graph is that of energy. The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of the adjacency matrix of G . The Laplacian energy of a graph G is equal to the sum of distances of the Laplacian eigenvalues of G and the average degree d(G) of G. In this paper we introduce the concept of Laplacian energy of fuzzy graphs. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer systems science and engineering
سال: 2023
ISSN: ['0267-6192']
DOI: https://doi.org/10.32604/csse.2023.029255